Solution techniques for a crane sequencing problem
نویسندگان
چکیده
منابع مشابه
A Scalable Solution for Adaptive Problem Sequencing and Its Evaluation
We propose an associative mechanism for adaptive generation of problems in intelligent tutors. Our evaluations of the tutors that use associative adaptation for problem sequencing show that 1) associative adaptation targets concepts less well understood by students; and 2) associative adaptation helps students learn with fewer practice problems. Apart from being domainindependent, the advantage...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
RoboTSP - A Fast Solution to the Robotic Task Sequencing Problem
In many industrial robotics applications, such as spot-welding, spray-painting or drilling, the robot is required to visit successively multiple targets. The robot travel time among the targets is a significant component of the overall execution time. This travel time is in turn greatly affected by the order of visit of the targets, and by the robot configurations used to reach each target. The...
متن کاملA multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach
Keywords: Quay crane assignment Quay crane scheduling Genetic algorithms Integrated models a b s t r a c t This paper presents a new approach to analyze the integrated quay crane assignment and scheduling problem (QCASP). The problem determines the assignment of quay cranes to vessels and the sequence of tasks to be processed by each quay crane simultaneously, and accounts for important conside...
متن کاملA Branch-and-Cut algorithm for factory crane scheduling problem
The factory crane scheduling problem (FCSP) deals with assigning delivery tasks to cranes and then sequencing them, in order to minimize the total completion time for all tasks. In this paper, delivery tasks for required jobs are preemptive allowed at most once before the jobs arrive at exit. The preemptive jobs are temporarily stored in a buffer stack, in which jobs pickup and delivery should ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics in Operational Research
سال: 2009
ISSN: 1757-5850,1757-5869
DOI: 10.1504/ijmor.2009.026276